Papers by Marco A. Valenzuela-Escárcega
Text Annotation Graphs: Annotating Complex Natural Language Phenomena (L18-1)
Copied to clipboard
| Challenge: | Text Annotation Graphs is a web-based tool for annotating text . it provides functionality for representing complex relationships between words and word phrases . |
| Approach: | They introduce a web-based tool for annotating text, Text Annotation Graphs, or TAG . it provides functionality for representing complex relationships between words and word phrases . |
| Outcome: | The proposed software can represent complex relationships between words and words . it can also be used to find similar structures within the current document or external annotated documents. |
MathAlign: Linking Formula Identifiers to their Contextual Natural Language Descriptions (2020.lrec-1)
Copied to clipboard
Maria Alexeeva, Rebecca Sharp, Marco A. Valenzuela-Escárcega, Jennifer Kadowaki, Adarsh Pyarelal, Clayton Morrison
| Challenge: | Existing approaches to extract mathematical concepts and their descriptions are useful for a variety of tasks, including math information retrieval and accessibility efforts to make scientific documents available to the visually impaired. |
| Approach: | They propose a rule-based approach which extracts LaTeX representations of formula identifiers and links them to their in-text descriptions, given only the original PDF and the location of the formula of interest. |
| Outcome: | The proposed approach extracts LaTeX representations of formula identifiers and links them to their in-text descriptions, given only the original PDF and the location of the formula of interest. |
Enabling Search and Collaborative Assembly of Causal Interactions Extracted from Multilingual and Multi-domain Free Text (N19-4)
Copied to clipboard
George C. G. Barbosa, Zechy Wong, Gus Hahn-Powell, Dane Bell, Rebecca Sharp, Marco A. Valenzuela-Escárcega, Mihai Surdeanu
| Challenge: | a new searchable knowledge graph allows users to search for causal interactions in multiple languages . a recent study shows that search tools are shallow and do not support multilingual research . |
| Approach: | They propose a system that integrates causal interactions into a single searchable knowledge graph. |
| Outcome: | The proposed system extracts over 600 thousand causal statements from 120 thousand Portuguese publications with a precision of 62%. |
From Examples to Rules: Neural Guided Rule Synthesis for Information Extraction (2022.lrec-1)
Copied to clipboard
Robert Vacareanu, Marco A. Valenzuela-Escárcega, George Caique Gouveia Barbosa, Rebecca Sharp, Gustave Hahn-Powell, Mihai Surdeanu
| Challenge: | a "deep learning tsunami" has brought tremendous improvements in performance to most NLP applications. |
| Approach: | They propose a method for rule synthesis from examples that combines the advantages of deep learning and rule-based methods. |
| Outcome: | The proposed method achieves state-of-the-art on 1-shot task and competitive performance in 5-shot scenario. |
Eidos, INDRA, & Delphi: From Free Text to Executable Causal Models (N19-4)
Copied to clipboard
Rebecca Sharp, Adarsh Pyarelal, Benjamin Gyori, Keith Alcock, Egoitz Laparra, Marco A. Valenzuela-Escárcega, Ajay Nagesh, Vikas Yadav, John Bachman, Zheng Tang, Heather Lent, Fan Luo, Mithun Paul, Steven Bethard, Kobus Barnard, Clayton Morrison, Mihai Surdeanu
| Challenge: | a paper proposes a method for building probabilistic models of complex phenomena such as food insecurity . currently, these models are hand-built for each new situation and require months to construct . |
| Approach: | They propose an approach that builds executable probabilistic models from raw, free text. |
| Outcome: | The proposed approach builds executable probabilistic models from raw, free text. |
A Human-machine Interface for Few-shot Rule Synthesis for Information Extraction (2022.naacl-demo)
Copied to clipboard
Robert Vacareanu, George C.G. Barbosa, Enrique Noriega-Atala, Gus Hahn-Powell, Rebecca Sharp, Marco A. Valenzuela-Escárcega, Mihai Surdeanu
| Challenge: | Vacareanu et al., 2021) proposes a system that helps users build transparent information extraction models . rule-based methods address the opacity of neural architectures by producing models that are transparent . |
| Approach: | They propose a system that assists a user in constructing transparent information extraction models . the system generates high-precision rules even in a 1-shot setting, they show . |
| Outcome: | The proposed system generates high-precision rules even in a 1-shot setting . it outperforms manually written patterns on a widely-used relation extraction dataset . |
Parsing as Tagging (2020.lrec-1)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing treat parse as tagging, but they are not perfect. |
| Approach: | They propose a simple yet accurate method that treats parsing as tagging . they use a sequence model with a bidirectional LSTM over BERT embeddings . |
| Outcome: | The proposed method outperforms the state-of-the-art method on universal dependency (UD) by 1.76% unlabeled attachment score (UAS) for English, 1.98% UAS for French, and 1.16% UAS in German. |
Odinson: A Fast Rule-based Information Extraction Framework (2020.lrec-1)
Copied to clipboard
| Challenge: | Odinson is a rule-based information extraction framework that matches over multiple representations of text in near real time. |
| Approach: | They propose a rule-based information extraction framework that matches patterns over multiple representations of text with a runtime system that operates in near real time. |
| Outcome: | The proposed framework matches a graph traversal in 2.8 seconds in a corpus of over 134 million sentences, nearly 150,000 times faster than its predecessor. |
An Unsupervised Method for Learning Representations of Multi-word Expressions for Semantic Classification (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for learning multi-word expressions have language sparsity and are not supervised. |
| Approach: | They propose an unsupervised approach to learning a compositional representation function for multi-word expressions . they use a Tratz dataset to train the composition function on the word-semantic relation . |
| Outcome: | The proposed method outperforms the previous state-of-the-art method on the Tratz dataset with an F1 score of 50.4%. |